package 力扣._00周赛._415周赛.问题1;

import java.util.List;

public class Solution {

    public int[] getSneakyNumbers(int[] nums) {
        int[] r = new int[2];
        int n = 0;
        int[] t = new int[nums.length - 2];
        for (int num : nums) {
            if (t[num] == 0) {
                t[num] = 1;
            } else {
                r[n++] = num;
            }
        }
        return r;

    }
    public static void main(String[] args) {

    }
}
